Routing in Intermittently Connected Networks using a Probabilistic Approach
نویسندگان
چکیده
In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There do however exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through such networks. We propose PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
منابع مشابه
Probabilistic Routing Protocol for Intermittently Connected Networks
This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning th...
متن کاملPerformance Analysis of Routing Protocols in Delay/Disruption Tolerant Mobile Ad Hoc Networks
In the last few years research activity in delay/disruption tolerant networks (DTN) is growing and researchers have proposed various types of routing protocols. Those efforts formulate DTN to become the adequate solution for the challenged network environment. DTN architecture provides good performance in the intermittently connected Mobile ad hoc networks (MANET). Routing in DTN architecture i...
متن کاملOn a Routing Problem within Probabilistic Graphs
Our problem formulation is as follows. Given a probabilistic graph G and routing algorithm A, we wish to determine a delivery subgraph G[A] of G with at most k edges, such that the probability Conn2(G[A]) that there is a path from source s to destination t in a graph H chosen randomly from the probability space defined by G[A] is maximized. To the best of our knowledge, this problem and its com...
متن کاملA Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks
The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, ...
متن کاملUtility-Based Distributed Routing in Intermittently Connected Networks
Intermittently connected mobile networks don’t have a complete path from a source to a destination at most of the time. Such an environment can be found in very sparse mobile networks where nodes meet only occasionally or in wireless sensor networks where nodes always sleep to conserve energy. Current transmission approaches in such networks are primarily based on: multi-copy flooding scheme an...
متن کامل